v = int(input())
res = 1 if v != 2 else 2
print(res)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define llu unsigned long long
#define int long long
const int M = 1e9+7;
#define all(x) (x).begin(),(x).end()
#define sbit(num, n) num|= (1 << n)
#define fbit(num, n) num^= (1 << n)
#define ubit(num, n) num&= ~(1 << n)
#define ifsbit(num, i) (num & ( 1 << i ) !=0 ) ? true : false
#define clrlsb(num, i) num = (num & (~((1 << (i + 1)) - 1)))
#define clrmsb(num, i) num = (num &((1 << (i + 1)) - 1))
void tcase()
{
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a;
cin>>a;
if(a==2)
{
cout<<2<<endl;
}
else cout<<1<<endl;
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.\n";
}
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |